CoLoSS: The Coalgebraic Logic Satisfiability Solver
نویسندگان
چکیده
منابع مشابه
CoLoSS: The Coalgebraic Logic Satisfiability Solver
CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...
متن کاملCoLoSS : The Coalgebraic Logic Satisfiability Solver ( System Description ) Georgel Calin
CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...
متن کاملCoalgebraic Logic
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that innnitary modal logic contains characterizing formulas. That is, every model-world pair is characterized up to bisimulation by an innnitary formula. The point of our generalization is to understand this on a deeper level. We do this by studying a frangm...
متن کاملOptimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a broadly applicable coalgebraic semantics and an ensuing general treatment of modal sequent and tableau calculi. Here, we present research into optimisation of the reasoning strategies employed in CoLoSS. Specifically, we ...
متن کاملCoalgebraic Hybrid Logic
We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.02.028